Solving decomposable sparse systems

Améndola et al. proposed a method for solving systems of polynomial equations lying in family which exploits recursive decomposition into smaller systems. A admits such if and only the corresponding Galois group is imprimitive. When imprimitive, we consider problem computing an explicit decomposition. consequence Esterov’s classification sparse with imprimitive groups that this obtained by inspection. This leads to algorithm compute complex isolated solutions decomposable systems, present give evidence its efficiency.